Crosstalk Minimization in Three-Layer HVH Channel Routing
نویسندگان
چکیده
Crosstalk has become a major issue in VLSI design due to the high fr equency, long interconnecting lines and small spacing between interconnects in today's integrated circuits. In this paper, we study the problem of crosstalk minimization in 3-layer HVH channel routing. A heuristic algorithm that combines layer reassignment and track reassignment is presented. This algorithm can iteratively modify the layout so that the crosstalk in the channel is minimized. Experimental results show that the proposed approach can reduce the crosstalk by an average of 16.4% on a set of benchmark examples.
منابع مشابه
Three Layer Routing for Reliability Enhancement
In this paper we study two important reliability issues in deep submicron VLSI design, namely antenna eeect and crosstalk noise, in the context of three-layer channel routing. Cost functions for both of the failure mechanisms are introduced and based on these cost models, reliability enhancement techniques are presented. For antenna eeect minimization, a layer reassignment algorithm is adopted ...
متن کاملAlgorithms for Reducing Crosstalk in Two-Layer Channel Routing
Crosstalk minimization is one of the most important high performance aspects in interconnecting VLSI circuits. With advancement of fabrication technology, devices and interconnecting wires are placed in closer proximity and circuits operate at higher frequencies. This results in crosstalk between wire segments. Crosstalk minimization problem for the reserved two-layer Manhattan channel routing ...
متن کاملConstrained via minimization
We show that the general two layer constrained via minimization problem and the three layer constrained via minimization problem for HVH topologies are NP-hard. A backtracking and a heuristic algorithm for the three layer HVH constrained via minimization problem are proposed. The backtracking algorithm can also be used for three layer non HVH problems. Experimental results indicate that our heu...
متن کاملA Review on Channel Routing On VLSI Physical Design
We know that channel routing is very important problem in VLSI physical design. The main objective of a channel routing algorithm is the reduction of the area of a IC chip. In this paper, we just do a survey on some impotent multi-layer routing algorithms. Here we analyze The Efficient Routing algorithm and resolve horizontal constraints and minimize the net wirelength in a particular model of ...
متن کاملAn Algorithm for Finding a Non-Trivial Lower Bound for Channel Routing
Channel routing is a key problem in the physical design of VLSI chips. It is known that ma4dmz, urn,,) is a lower bound on the number of tmcka requared in the reserved two-layer Manhattan routine model. where d,,,,, is the channel density and vi, is the length oftKe longest path in the vertical constraint omvh. In this paver we vropose a polynomial time algorithm that ‘wmput’es a better and non...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997